Article 2415

Title of the article

ON ERROR PROBABILITY IN ONE MODEL OF COMPUTATION

Authors

Alekhina Marina Anatol'evna, Doctor of physical and mathematical sciences, professor, head of sub-department of discrete mathematics, Penza State University (40 Krasnaya street, Penza, Russia), alehina@pnzgu.ru

Index UDK

519.718

Abstract

Background. Multivalued logic offers ample opportunities for development of various algorithms in many fields. It is successfully applied for solution of many problems and in many technical developments. These facts explain an interest to various models of computation, including circuits compiled of functional gates. The present work continues researching unreliability of circuits realizing functions of kmeaning logic (k ≥ 3); the aim of the work is to reveal properties of sub-circuits, error probability of which determines the lower value of unreliability of the whole circuit.
Materials and methods. The study was based on the well-known methods of discrete mathematics and mathematical cybernetics that provided values of circuit unreliability and allowed to assess a number of functions of special type.
Results. For a random k ≥ 3 the author has found sub-circuits, the error probability of which enables to assess reliability of the whole circuit, while the class of functions, realized by the said sub-circuits, has been significantly expanded. The previ-ously known class of such functions of four valued logic has been expanded in such a manner that any circuit, realizing the function of this class, holds the lower value of reliability in the Rosser-Turkett basis.
Conclusions. Error probability of some unreliable sub-circuits determines the lower value of unreliability of the whole system.

Key words

k-meaning logics functions, unreliable functional gates, synthesis of circuits composed of unreliable gates.

Download PDF
References

1. Vasin A. V. Izvestiya vysshikh uchebnykh zavedeniy. Povolzhskiy region. Fizikomatematicheskie nauki [University proceedings. Volga region. Physical and mathematical sciences]. 2010, no. 1 (13), pp. 64–79.
2. Alekhina M. A. Diskretnaya matematika [Discrete mathematics]. 2012, vol. 24, no. 3, pp. 17−24.
3. Alekhina M. A. Fundamenta Informaticae [Fundamental informatics]. 2010, vol. 104 (3), pp. 219–225.
4. Grabovskaya S. M. Izvestiya vysshikh uchebnykh zavedeniy. Povolzhskiy region. Fizikomatematicheskie nauki [University proceedings. Volga region. Physical and mathematical sciences]. 2011, no. 3 (19), pp. 52–60.
5. Alekhina M. A. Izvestiya vysshikh uchebnykh zavedeniy. Povolzhskiy region. Fizikomatematicheskie nauki [University proceedings. Volga region. Physical and mathematical sciences]. 2015, no. 3 (35), pp. 3–10.
6. Alekhina M. A., Barsukova O. Yu. Izvestiya vysshikh uchebnykh zavedeniy. Povolzhskiy region. Fiziko-matematicheskie nauki [University proceedings. Volga region. Physical and mathematical sciences]. 2014, no. 1 (29), pp. 5–19.
7. Alekhina M. A., Kargin S. P. Izvestiya vysshikh uchebnykh zavedeniy. Fizikomatematicheskie nauki [University proceedings. Volga region. Physical and mathematical sciences]. 2015, no. 1 (33), pp. 37–53.
8. Yablonskiy S. V. Vvedenie v diskretnuyu matematiku [Introduction into discrete mathematics]. Moscow: Vysshaya shkola, 2001, 384 p.

 

Дата создания: 12.04.2016 09:24
Дата обновления: 12.04.2016 09:49